The effect of discrete vs. continuous-valued ratings on reputation and ranking systems
نویسندگان
چکیده
When users rate objects, a sophisticated algorithm that takes into account ability or reputation may produce a fairer or more accurate aggregation of ratings than the straightforward arithmetic average. Recently a number of authors have proposed different co-determination algorithms where estimates of user and object reputation are refined iteratively together, permitting accurate measures of both to be derived directly from the rating data. However, simulations demonstrating these methods’ efficacy assumed a continuum of rating values, consistent with typical physical modelling practice, whereas in most actual rating systems only a limited range of discrete values (such as a 5-star system) is employed. We perform a comparative test of several co-determination algorithms with different scales of discrete ratings and show that this seemingly minor modification in fact has a significant impact on algorithms’ performance. Paradoxically, where rating resolution is low, increased noise in users’ ratings may even improve the overall performance of the system. Introduction. – With the growth of the internet and e-commerce [1], an increasing number of our social and commercial interactions are now one-shot exchanges with strangers identifiable only by easily-replaced pseudonyms [2]. Similarly, most items on sale from ecommerce websites must be purchased without an opportunity to try them first, creating an information asymmetry that encourages the provision of low-quality goods [3]. To offset this risk of fraud or deception, many online services implement reputation systems [4] that collect ratings and feedback from users so as to provide a measure of trustworthiness for goods or individuals. A key challenge is how to aggregate this feedback effectively given that not all ratings are equal. Some users’ judgement may be poor or malicious: for example, many eBay users forgo issuing negative feedback to cheaters because the mendaciously negative response will devastate their own carefully cultivated good reputation [5]. An effective reputation system thus needs to distinguish between good and bad raters and ratings. (a)E-mail: [email protected] (b)E-mail: [email protected]. Present address: CREATE-NET Via alla Cascata 56D, 38123 Povo di Trento, Italy. One approach to this has been the development of codetermination algorithms of reputation, where aggregate reputation (or quality) of rated objects is used to estimate a corresponding reputation (or ability) for the system’s users, and this latter measure is then used to re-weight the aggregation of ratings for objects [6–8]. By iterating this procedure over time, ratings from malicious or unskilled users can be weeded out, providing both a better estimation of object quality and an enhanced overall reputation-based ranking of objects. Simulations to evaluate the effectiveness of these methods followed typical modelling practices in physics and applied mathematics, assuming a continuum of rating values (reflecting what may be presumed to be fine-grained shades of opinion). However, a near-universal feature of real user feedback and rating systems is that they permit ratings to take only a limited range of discrete values— most commonly the 5-star system employed by Amazon, YouTube, etc. The influence of this constraint has never 1 We use ‘object’ simply as a generic term: the object of the rating. This might be an actual object, such as a book or CD, or it might be a person or organisation, such as an eBay auctioneer, a website, or an Amazon Marketplace seller.
منابع مشابه
Continuous Ratings in Discrete Bayesian Reputation Systems
Reputation systems take as input ratings from members in a community, and can produce measures of reputation, trustworthiness or reliability of entities in the same community. Binomial and multinomial Bayesian reputation systems are discrete in nature meaning that they normally take discrete ratings such as “average” or “good” as input. However, in many situations it is natural to provide input...
متن کاملTowards an objective ranking in online reputation systems: the effect of the rating projection
Online reputation systems are commonly used by e-commerce providers nowadays. In order to generate an objective ranking of online items’ quality according to users’ ratings, many sophisticated algorithms have been proposed in the literature. In this paper, instead of proposing new algorithms we focus on a more fundamental problem: the rating projection. The basic idea is that even though the ra...
متن کاملBuilding reputation systems for better ranking
How to rank web pages, scientists and online resources has recently attracted increasing attention from both physicists and computer scientists. In this paper, we study the ranking problem of rating systems where users vote objects by discrete ratings. We propose an algorithm that can simultaneously evaluate the user reputation and object quality in an iterative refinement way. According to bot...
متن کاملGroup-based ranking method for online rating systems with spamming attacks
Ranking problem has attracted much attention in real systems. How to design a robust ranking method is especially significant for online rating systems under the threat of spamming attacks. By building reputation systems for users, many well-performed ranking methods have been applied to address this issue. In this Letter, we propose a group-based ranking method that evaluates users’ reputation...
متن کاملSome new variants of interval-valued Gronwall type inequalities on time scales
By using an efficient partial order and concept of gH-differentiability oninterval-valued functions, we investigate some new variants of Gronwall typeinequalities on time scales, which provide explicit bounds on unknownfunctions. Our results not only unify and extend some continuousinequalities, but also in discrete case, all are new.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1001.3745 شماره
صفحات -
تاریخ انتشار 2010